翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Delta lemma : ウィキペディア英語版
Sunflower (mathematics)

In mathematics, a sunflower or Δ system is a collection of sets whose pairwise intersection is constant, and called the kernel.
The Δ lemma, sunflower lemma, and sunflower conjecture give various conditions that imply the existence of a large sunflower in a given collection of sets.
The original term for this concept was "Δ-system". More recently the term "sunflower", possibly introduced by , has been gradually replacing it.
== Formal definition ==

Suppose ''U'' is a universe set and ''W'' is a collection of subsets of ''U''. The collection ''W'' is a ''sunflower'' (or ''Δ-system'') if there is a subset ''S'' of ''U'' such that for each distinct ''A'' and ''B'' in ''W'', we have ''A'' ∩ ''B'' = ''S''. In other words, ''W'' is a sunflower if the pairwise intersection of each set in ''W'' is constant.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Sunflower (mathematics)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.